Convergence of Inner/outer Source Iterations with Finite Termination of the Inner Iterations

نویسندگان

  • PAUL NELSON
  • BENY NETA
چکیده

A two-stage (nested) iteration strategy, in which the outer iteration is analogous to a block Gauss-Seidel method and the inner iteration to a Jacobi method for each of these blocks, often are used in the numerical solution of discretized approximations to the neutron transport equation. This paper is concerned with the effect, within a continuous space model, of errors from finite termination of the inner iterations upon the overall convergence. The main result is that convergence occurs, to the solution of the original problem, in the limit that both the outer iteration index and the minimum over all outer indices and all groups ("blocks") jointly become large. Positivity properties (in the sense of cone preserving) are used extensively. 1. In t roduct ion. A first step in computationally solving energy dependent linear (steady state) particle transport problems often is to introduce so-called outer (energy/group) source iteration. Conceptually, each step within this iteration involves solution of a sequence of monoenergetic transport problems. It is widespread practice to solve these by inner (direction) source iteration. This paper is concerned with the effect of the (computationally necessary) finite termination of the inner iterations upon the convergence of the approximations produced by the outer iterations. It is self-contained regarding the technical aspects of these iterative processes, but the interested reader is referred to the monographs by Bell and Glasstone [1], Duderstadt and Martin [2], Lewis and Miller [3], and Marchuk and Lebedev [4] for further background in transport theory. Suppose that the underlying "exact" transport problem is subcriticai (satisfies assumption A.4 of the next section), and denote the corresponding angular flux (the vector of dependent variables) by ip = ip(x). If ij)() = ^?(*)(#) denotes the zth approximation from the outer source iteration, then it is relatively easy (see §11 for an example) to show that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

متن کامل

Inexact Inverse Iterations for the Generalized Eigenvalue Problems

In this paper, we study an inexact inverse iteration with inner-outer iterations for solving the generalized eigenvalue problem Ax = Bx; and analyze how the accuracy in the inner iterations aaects the convergence of the outer iterations. By considering a special stopping criterion depending on a threshold parameter, we show that the outer iteration converges linearly with the threshold paramete...

متن کامل

A black box generalized conjugate gradient minimum residual method based on variable preconditioners and local element approximations

In order to control the accuracy of a preconditioner for an outer iterative process one often involves variable preconditioners. The variability may for instance be due to the use of inner iterations in the construction of the preconditioner. Both the outer and inner iterations may be based on some conjugate gradient type of method, e.g. generalized minimum residual methods. A background for su...

متن کامل

Convergence of nested classical iterative methods for linear systems

Classical iterative methods for the solution of algebraic linear systems of equations proceed by solving at each step a simpler system of equations. When this system is itself solved by an (inner) iterative method, the global method is called a two-stage iterative method. If this process is repeated, then the resulting method is called a nested iterative method. We study the convergence of such...

متن کامل

An Inexact Cayley Transform Method For Inverse Eigenvalue Problems

The Cayley transform method is a Newton-like method for solving inverse eigenvalue problems. If the problem is large, one can solve the Jacobian equation by iterative methods. However, iterative methods usually oversolve the problem in the sense that they require far more (inner) iterations than is required for the convergence of the Newton (outer) iterations. In this paper, we develop an inexa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008